p-competition graphs
نویسندگان
چکیده
منابع مشابه
Cycles and p-competition graphs
The notion of a p-competition graph and the p-competition number of a graph were introduced by S. -R. Kim, T. A. McKee, F. R. McMorris, and F. S. Roberts as a generalization of a competition graph and the competition number of a graph, respectively. Let p be a positive integer. The p-competition graph Cp(D) of a digraph D = (V, A) is a (simple undirected) graph which has the same vertex set V a...
متن کاملThe p-Competition Graphs of Symmetric Digraphs and p-Neighborhood Graphs
The p-competition graph G of a digraph D is a graph on the same vertex set as D, with x; y] 2 E(G) if and only if jOut(x) \Out(y)j p in D. In this paper we focus on the case in which D is a symmetric digraph ((a; b) is an arc in D if and only if (b; a) is an arc in D). We relate the problem to 2-step graphs, squares, and a generalization of the neighborhood graph called the p-neighborhood graph...
متن کاملCompetition graphs of semiorders and the conditions C(p) and C*(p)
Given a digraph D, its competition graph has the same vertex set and an edge between two vertices x and y if there is a vertex u so that (x, u) and (y, u) are arcs of D. Motivated by a problem of communications, we study the competition graphs of the special digraphs known as semiorders. This leads us to define a conditions on digraphs called C(p) and C(p) and to study the graphs arising as com...
متن کامل(i, J) Competition Graphs
Hefner, K.A.S., K.F. Jones, S. Kim, J.R. Lundgren and F.S. Roberts, (i,j) competition graphs, Discrete Applied Mathematics 32 (1991) 241-262. If D is an acyclic digraph, its competition graph has the same vertex set as D and an edge between vertices x and y if and only if for some vertex u, there are arcs (_q u) and (_Y, u) in D. We study competition graphs of acyclic digraphs D when the indegr...
متن کامل2-Competition Graphs
If D (V, A) is a digraph, its p-competition graph for p a positive integer has vertex set V and an edge between x and y if and only if there are distinct vertices a, , a n in D with (x, a and (y, a) arcs of D for each 1, , p. This notion generalizes the notion of ordinary competition graph, which has been widely studied and is the special case where p 1. Results about the case where p 2 are obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1995
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00060-q